CS 280 — Data Structures (5 cr)
This course explores data types, abstract data types, and data structures. Efficiency of algorithms is discussed extensively. Sequential and linked lists will be implemented. Students will be able to create, represent, and traverse binary trees. Searching is extensively covered, including dictionaries, priority queues, and hashing. Directed graphs and depth-first algorithms will be introduced. Additional topics include: garbage collection, dynamic storage allocation and sorting. Prerequisite: CS 142. (SFCC)
View SFCC Course Learning Outcomes